Fuzzy Domination Graphs in Decision Support Tasks
نویسندگان
چکیده
In decision support tasks, one often has to deal with uncertainty due fuzzy judgments of the maker or expert. This paper proposes methods that allow you rank alternatives based on evaluations. is achieved by using weighted summation, implication, a computation graph showing criteria, and dominance alternatives. If criteria have equal importance, then graphs corresponding each are used. An algorithm used for both transition from ranking proposed. idea constructing Kemeny medians other concordant rankings at given confidence level in existence arcs. Computational experiments shown performance these approaches. It reasonable apply them problems require complex expert evaluations large number criteria.
منابع مشابه
Excellent Domination in Fuzzy Graphs
Let G be a fuzzy graph. A subset D of V is said to be Fuzzy dominating set if every vertex u ∈ V (G) there exists a vertex v ∈ V −D such that uv ∈ E(G) and μ(uv) 6 σ(u) ∧ σ(v). The minimum Cardinality of fuzzy dominating set is denoted by γf . A graph G is said to be fuzzy excellent if every vertex of G belongs to γf -sets of G. In this paper, we give a construction to imbedded non-excellent fu...
متن کاملReduction of Domination Parameter in Fuzzy Graphs
In this paper, the cobondage set and cobondage number bC(G) of a fuzzy graph G are defined. The upper bound of a fuzzy graph with p nodes is given as min(p − (1 + S(G)), S(G) + 1). The exact values of bC(G) for some standard fuzzy graphs are found. Some results on bC(G) are also discussed. A numerical example is also illustrated. AMS subject classification: 03E72, 05C40, 05C72.
متن کاملEdge Domination in Intuitionistic Fuzzy Graphs
In this paper we introduce the concept of edge domination and total edge domination in intuitionistic fuzzy graphs. We determine the edge domination number and total edge domination number for several classes of intuitionistic fuzzy graphs and obtain bounds for them. We also obtain Nordhaus gaddum type results for the parameters.
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملNon Split Domination on Intuitionistic Fuzzy Graphs
A dominating set D of an IFG G = (V, E) is a non-split dominating set, if the induced intuitionistic fuzzy subgraph 〈ܸ − 〉ܦ is connected. The Non-split domination number ߛ ௦ ሺܩሻ of IFG G is the minimum cardinality of all Non-split dominating set. In this paper we study some theorems in Non-split dominating sets of IFG and some results of ߛ ௦ ሺܩሻwith other known parameters of IFG G. 1. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11132837